翻訳と辞書 |
covering number : ウィキペディア英語版 | covering number
In mathematics, the idea of a ''covering number'' is to count how many small spherical balls would be needed to completely cover (with overlap) a given space. There are two closely related concepts as well, the ''packing number'', which counts how many disjoint balls fit in a space, and the ''metric entropy'', which counts how many points fit in a space when constrained to lie at some fixed minimum distance apart. == Mathematical Definition ==
More precisely, consider a subset of a metric space and a parameter . Denote the ball of radius centered at the point by . There are two notions of covering number, internal and external, along with the packing number and the metric entropy. * The packing number is the fewest number of points such that the balls cover . * The external covering number is the largest number of points such that the points are -separated, i.e. for all .
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「covering number」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|